package quna;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

/**
 * Created by lxy_920912 on 01/04/2017.
 */
public class Main {
    public static void main(String[] args) {
        /*
          Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int [][]arr = new int[n][3];
        int score = 0;
        Map<String,Boolean> map = new HashMap<>();
        for(int i = 0;i < n;i++) {
            for (int j = 0; j < 3; j++) {
                arr[i][j] = scanner.nextInt();

            }

            String key = arr[i][0] + "";
            if (arr[i][1] == 1) {
                if (arr[i][2] == 1) {
                    score = score + 30;

                } else {

                    if (map.containsKey(key)) {
                        score = score + 5;
                    } else {
                        score = score + 10;
                    }
                }
                map.put(key, true);
            }
        }
        System.out.println(score);
        * */
        int [] a = new int[5];
        for(int i = 0;i < 5;i++){
            a[i] = i;
        }
        String s = a.toString();
        System.out.println(s);

    }

}
